Intelligent Job Shop Scheduling Based on MAS and Integrated Routing Wasp Algorithm and Scheduling Wasp Algorithm

نویسندگان

  • Yan Cao
  • Yanli Yang
  • Huamin Wang
  • Lina Yang
چکیده

Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. An organization structure for intelligent job shop scheduling based on MAS (Multiple Agents System) is put forward to achieve effective and efficient production. A hybrid multilayer agent structure is put forward to facilitate constructing various agents. Consequently, all resources in a manufacturing system are reorganized into an agile manufacturing network of agents of autonomous and cooperative characteristics. Regarding wasps as a specific kind of agents, wasp colony algorithms are used to solve job shop dynamic scheduling problem. Based on the principle of the wasp colony algorithm, two different algorithms, namely the routing wasp algorithm and the scheduling wasp algorithm, are combined to solve the job shop dynamic scheduling problem. The algorithms are modified to better adapt to job shop dynamic scheduling environment. The algorithms are developed based on Eclipse 3.2 and J2SE 6.0. Simulation experiments are accomplished and experimental data are analyzed. The results show that the principle of the algorithms is simple, their computational quantity is small, and they can be applied to multi-batch dynamic scheduling with unpredictable entry time due to their favorable potential.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2009